graph0
graph0node=[]node=[0]!astartnode=[1]!bnode=[2](invoke> + 2)node=[3]!v1+node=[4]<pop>node=[5]!cnode=[6]<pop>node=[7]!cnode=[8]if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path1: [start→then→then→then→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path2: [start→then→then→then→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path3: [start→then→then→then→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path4: [start→then→then→then→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path5: [start→then→then→then→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path6: [start→then→then→then→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path7: [start→then→then→then→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path8: [start→then→then→then→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path9: [start→then→then→then→else→else→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path10: [start→then→then→then→else→else→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path11: [start→then→then→then→else→else→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path12: [start→then→then→then→else→else→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path13: [start→then→then→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path14: [start→then→then→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path15: [start→then→then→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2] PATH ERRORS: !v2 is a reference before definition!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path16: [start→then→then→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path17: [start→then→then→else→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path18: [start→then→then→else→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path19: [start→then→then→else→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path20: [start→then→then→else→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path21: [start→then→then→else→else→else→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path22: [start→then→then→else→else→else→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path23: [start→then→then→else→else→else→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path24: [start→then→then→else→else→else→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1] PATH ERRORS: !v2 is a reference before definition!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path25: [start→then→else→then→then→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path26: [start→then→else→then→then→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path27: [start→then→else→then→then→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path28: [start→then→else→then→then→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path29: [start→then→else→then→then→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path30: [start→then→else→then→then→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path31: [start→then→else→then→then→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path32: [start→then→else→then→then→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path33: [start→then→else→then→then→else→else→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path34: [start→then→else→then→then→else→else→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path35: [start→then→else→then→then→else→else→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path36: [start→then→else→then→then→else→else→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path37: [start→then→else→then→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path38: [start→then→else→then→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path39: [start→then→else→then→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path40: [start→then→else→then→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path41: [start→then→else→then→else→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path42: [start→then→else→then→else→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path43: [start→then→else→then→else→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path44: [start→then→else→then→else→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path45: [start→then→else→then→else→else→else→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path46: [start→then→else→then→else→else→else→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path47: [start→then→else→then→else→else→else→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path48: [start→then→else→then→else→else→else→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path49: [start→then→else→else→then→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path50: [start→then→else→else→then→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path51: [start→then→else→else→then→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path52: [start→then→else→else→then→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path53: [start→then→else→else→then→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path54: [start→then→else→else→then→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path55: [start→then→else→else→then→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path56: [start→then→else→else→then→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path57: [start→then→else→else→then→else→else→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path58: [start→then→else→else→then→else→else→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path59: [start→then→else→else→then→else→else→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path60: [start→then→else→else→then→else→else→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path61: [start→then→else→else→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path62: [start→then→else→else→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path63: [start→then→else→else→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path64: [start→then→else→else→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path65: [start→then→else→else→else→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path66: [start→then→else→else→else→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path67: [start→then→else→else→else→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path68: [start→then→else→else→else→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path69: [start→then→else→else→else→else→else→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path70: [start→then→else→else→else→else→else→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path71: [start→then→else→else→else→else→else→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path72: [start→then→else→else→else→else→else→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0]!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path73: [start→else→then→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path74: [start→else→then→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path75: [start→else→then→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path76: [start→else→then→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path77: [start→else→then→else→then→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path78: [start→else→then→else→then→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path79: [start→else→then→else→then→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path80: [start→else→then→else→then→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path81: [start→else→then→else→else→then→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path82: [start→else→then→else→else→then→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path83: [start→else→then→else→else→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path84: [start→else→then→else→else→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path85: [start→else→else→then→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1
graph0-path86: [start→else→else→else→term]
graph0node=[] size=0node=[0] size=1!astartnode=[1] size=2!bnode=[2] size=1(invoke> + 2)node=[3] size=1!v1+node=[4] size=0<pop>node=[5] size=1!cnode=[6] size=0<pop>node=[7] size=1!cnode=[8] size=0if>node=[8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 0] PATH ERRORS: stack size=0, operation !v2+ needs >=1!v2+elsenode=[9](invoke> * 2)node=[10](invoke> = 2)node=[11]if>node=[11 :then 0] TREE ERRORS: a is not an allowed opathennode=[11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 1]!anode=[8 :then 2]!bnode=[8 :then 3](invoke> + 2)node=[8 :then 4]!v1+node=[8 :then 5]<pop>node=[8 :then 6]!cnode=[8 :then 7]<pop>node=[8 :then 8]!cnode=[8 :then 9]if>node=[8 :then 9 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 9 :else 0]!v2+elsenode=[8 :then 10](invoke> * 2)node=[8 :then 11](invoke> = 2)node=[8 :then 12]if>node=[8 :then 12 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 12 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 13]!bnode=[8 :then 14](invoke> + 2)node=[8 :then 15]!v1+node=[8 :then 16]<pop>node=[8 :then 17]!cnode=[8 :then 18]<pop>node=[8 :then 19]!cnode=[8 :then 20]if>node=[8 :then 20 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :then 20 :else 0]!v2+elsenode=[8 :then 21](invoke> * 2)node=[8 :then 22](invoke> = 2)node=[8 :then 23]if>node=[8 :then 23 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :then 23 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :then 24]!v1node=[8 :then 25]!v2node=[8 :then 26](invoke> println 4)node=[8 :else 1]!bnode=[8 :else 2]if>node=[8 :else 2 :then 0]!athennode=[8 :else 2 :else 0]!belsenode=[8 :else 3]<pop>node=[8 :else 4]!v1node=[11 :then 1]!v1node=[11 :then 2]!v2node=[11 :then 2 nil]node=[11 :else 1]!v2node=[11 :else 2]!v1node=[11 :else 2 nil]node=[8 :then 9 :then 1]!anode=[8 :then 9 :then 2]!v1node=[8 :then 9 :then 3]!v2node=[8 :then 9 :then 4](invoke> println 4)node=[8 :then 9 :else 1]!bnode=[8 :then 9 :else 2]if>node=[8 :then 9 :else 2 :then 0]!athennode=[8 :then 9 :else 2 :else 0]!belsenode=[8 :then 9 :else 3]<pop>node=[8 :then 9 :else 4]!v1node=[8 :then 12 :then 1]!v1node=[8 :then 12 :then 2]!v2node=[8 :then 12 :else 1]!v2node=[8 :then 12 :else 2]!v1node=[8 :then 20 :then 1]!anode=[8 :then 20 :then 2]!v1node=[8 :then 20 :then 3]!v2node=[8 :then 20 :then 4](invoke> println 4)node=[8 :then 20 :else 1]!bnode=[8 :then 20 :else 2]if>node=[8 :then 20 :else 2 :then 0]!athennode=[8 :then 20 :else 2 :else 0]!belsenode=[8 :then 20 :else 3]<pop>node=[8 :then 20 :else 4]!v1node=[8 :then 23 :then 1]!v1node=[8 :then 23 :then 2]!v2node=[8 :then 23 :else 1]!v2node=[8 :then 23 :else 2]!v1node=[8 :else 2 :then 1]!bnode=[8 :else 2 :then 2](invoke> + 2)node=[8 :else 2 :then 3]!v1+node=[8 :else 2 :then 4]<pop>node=[8 :else 2 :then 5]!cnode=[8 :else 2 :then 6]<pop>node=[8 :else 2 :then 7]!cnode=[8 :else 2 :then 8]if>node=[8 :else 2 :then 8 :then 0] TREE ERRORS: printl is not a known function! 0 is not a valid arity (must be pos-int)!(invoke> printl 0)thennode=[8 :else 2 :then 8 :else 0]!v2+elsenode=[8 :else 2 :then 9](invoke> * 2)node=[8 :else 2 :then 10](invoke> = 2)node=[8 :else 2 :then 11]if>node=[8 :else 2 :then 11 :then 0] TREE ERRORS: a is not an allowed opathennode=[8 :else 2 :then 11 :else 0] TREE ERRORS: b is not an allowed opbelsenode=[8 :else 2 :then 12]!v1node=[8 :else 2 :then 13]!v2+node=[8 :else 2 :then 14](invoke> println 2)node=[8 :else 2 :else 1]!v2node=[8 :else 2 :else 2]<pop>node=[8 :else 2 :else 3]!v1node=[8 :then 9 :else 2 :then 1]!v1node=[8 :then 9 :else 2 :then 2]!v2+node=[8 :then 9 :else 2 :then 3](invoke> println 2)node=[8 :then 9 :else 2 :else 1]!v2node=[8 :then 9 :else 2 :else 2]<pop>node=[8 :then 9 :else 2 :else 3]!v1node=[8 :then 20 :else 2 :then 1]!v1node=[8 :then 20 :else 2 :then 2]!v2+node=[8 :then 20 :else 2 :then 3](invoke> println 2)node=[8 :then 20 :else 2 :else 1]!v2node=[8 :then 20 :else 2 :else 2]<pop>node=[8 :then 20 :else 2 :else 3]!v1node=[8 :else 2 :then 8 :then 1]!anode=[8 :else 2 :then 8 :then 2]!v1node=[8 :else 2 :then 8 :then 3]!v2node=[8 :else 2 :then 8 :then 4](invoke> println 4)node=[8 :else 2 :then 8 :else 1]!bnode=[8 :else 2 :then 8 :else 2]if>node=[8 :else 2 :then 8 :else 2 :then 0]!athennode=[8 :else 2 :then 8 :else 2 :else 0]!belsenode=[8 :else 2 :then 8 :else 3]<pop>node=[8 :else 2 :then 8 :else 4]!v1node=[8 :else 2 :then 11 :then 1]!v1node=[8 :else 2 :then 11 :then 2]!v2node=[8 :else 2 :then 11 :else 1]!v2node=[8 :else 2 :then 11 :else 2]!v1node=[8 :else 2 :then 8 :else 2 :then 1]!v1node=[8 :else 2 :then 8 :else 2 :then 2]!v2+node=[8 :else 2 :then 8 :else 2 :then 3](invoke> println 2)node=[8 :else 2 :then 8 :else 2 :else 1]!v2node=[8 :else 2 :then 8 :else 2 :else 2]<pop>node=[8 :else 2 :then 8 :else 2 :else 3]!v1